Jordan Form-Based Algebraic Conditions for Controllability of Multiagent Systems under Directed Graphs
نویسندگان
چکیده
منابع مشابه
Algebraic Aspects of Controllability for Ar-systems
This paper examines some aspects of controllability for behaviour systems in AR-representation. The approach is based on the theory of dipolynomial modules and dipolynomial matrices. Explicit criteria for controllability in terms of the representing matrices are derived and an eeective test algorithm is given. Furthermore, controllability indices are introduced for AR-systems. The new theory is...
متن کاملState Emulator-based Adaptive Architectures for Resilient Networked Multiagent Systems over Directed and Time-varying Graphs
In this paper, we present adaptive architectures for networked multiagent systems operating over directed networks to achieve resilient coordination in the presence of disturbances. Specifically, we consider a class of unforeseen adverse conditions consisting of persistent exogenous disturbances and present a state emulator-based distributed adaptive control architecture to retrieve the nominal...
متن کاملIndirect controllability of locally coupled systems under geometric conditions
We consider systems of two wave/heat/Schrödinger-type equations coupled by a zero order term, only one of them being controlled. We prove an internal and a boundary null-controllability result in any space dimension, provided that both the coupling and the control regions satisfy the Geometric Control Condition. This includes several examples in which these two regions have an empty intersection.
متن کاملKalman controllability decompositions for differential-algebraic systems
We study linear differential-algebraic control systems and investigate decompositions with respect to controllability properties. We show that the augmented Wong sequences can be exploited for a transformation of the system into a Kalman controllability decomposition (KCD). The KCD decouples the system into a completely controllable part, an uncontrollable part given by an ordinary differential...
متن کاملAn Algebraic Framework of Weighted Directed Graphs
We show that an algebraic formulation of weighted directed graphs leads to introducing a k-vector space equipped with two coproducts ∆ and˜∆ verifying the so-called coassociativity breaking equation (˜ ∆ ⊗ id)∆ = (id ⊗∆) ˜ ∆. Such a space is called an L-coalgebra. Explicit examples of such spaces are constructed and links between graph theory and coassociative coalgebras are given. 1. Introduct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2020
ISSN: 1076-2787,1099-0526
DOI: 10.1155/2020/7685460